Hard Knapsack Problems That Are Easy for Local Search
نویسنده
چکیده
Chvv atal (1980) describes a class of zero-one knapsack problems provably diicult for branch and bound and dynamic programming algorithms. Chung et al. (1988) identiies a class of integer knapsack problems hard for branch and bound algorithms. We show that for both classes of problems local search provides optimal solutions quickly.
منابع مشابه
Local Search and Memetic Algorithms for Knapsack Problems
The 0-1 knapsack problem (KP) is widely studied in the last few decades. Despite of their simple structures, KP along with its extended versions belong to the class of NP-hard problems, and several optimization techniques have been developed to solve the problems. Some major examples are branch and bound methods and dynamic programming approaches [6], problemspecific heuristics [6], tabu search...
متن کاملA Novel Evolutionary Algorithm for Multidimensional Knapsack Problem
Binary optimization problems are in the most case the NP-hard problems that call to satisfy an objective function with or without constraints. Various optimization problems can be formulated in binary expression whither they can be resolved in easier way. Optimization literature supplies a large number of approaches to find solutions to binary hard problems. However, most population-based algor...
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملNew trends in exact algorithmsfor the 0 - 1 knapsack
While the 1980s were focused on the solution of large sized \easy" knapsack problems , this decade has brought several new algorithms, which are able to solve \hard" large sized instances. We will give an overview of the recent techniques for solving hard knapsack problems, with special emphasis on the addition of cardinality constraints , dynamic programming, and rudimentary divisibility. Comp...
متن کاملA simplified binary harmony search algorithm for large scale 0-1 knapsack problems
As an important subset of combinatorial optimization, 0–1 knapsack problems, especially the highdimensional ones, are often difficult to solve. This study aims to provide a new simplified binary harmony search (SBHS) algorithm to tackle such NP-hard problems arising in diverse research fields. The key difference between SBHS and other HS methods is in the process of improvisation. The differenc...
متن کامل